Natural Deduction Calculus for Computation Tree Logic CTL
نویسندگان
چکیده
We present a natural deduction calculus for the computation tree logic CTL defined with the full set of classical and temporal logic operators. The system extends the natural deduction construction of the linear-time temporal logic. This opens the prospect to apply our technique as an automatic reasoning tool in a deliberative decision making framework across various applications in AI and Computer Science, where the branching-time setting is required.
منابع مشابه
Deontic Extension of Deductive Verification of Component Model: Combining Computation Tree Logic and Deontic Logic in Natural Deduction Style Calculus
In this paper we present a natural deduction calculus for branching-time deontic logic, a combination of the branching-time logic CTL and deontic modalities. We show how this new proof technique can be applied as a reasoning tool in modeling dynamic normative systems, namely, Grid Component System. We formally define behaviour of stateful components and a concept of a re-configuration showing h...
متن کاملReducing Validity in Epistemic ATL to Validity in Epistemic CTL
We propose a validity preserving translation from a subset of epistemic Alternating-time Temporal Logic (ATL) to epistemic Computation Tree Logic (CTL). The considered subset of epistemic ATL is known to have the finite model property and decidable model-checking. This entails the decidability of validity but the implied algorithm is unfeasible. Reducing the validity problem to that in a corres...
متن کاملFormalization of CTL* in Calculus of Inductive Constructions
A modular formalization of the branching time temporal logic CTL∗ is presented. Our formalization subsumes prior formalizations of propositional linear temporal logic (PTL) and computation tree logic (CTL). Moreover, the modularity allows to instantiate our formalization for different formal security models. Validity of axioms and soundness of inference rules in axiomatizations of PTL, UB, CTL,...
متن کاملCalculational Reasoning Revisited (An Isabelle/Isar Experience)
We discuss the general concept of calculational reasoning within Isabelle/Isar, which provides a framework for high-level natural deduction proofs that may be written in a human-readable fashion. Setting out from a few basic logical concepts of the underlying meta-logical framework of Isabelle, such as higher-order unification and resolution, calculational commands are added to the basic Isar p...
متن کاملOn Expressive and Model Checking Power of Propositional Program Logics (extended Abstract of a Short Talk) Ctl and C vs. Second-order Logics
We examine when a model checker for a propositional program logic can be used for checking another propositional program logic in spite of lack of expressive power of the rst logic. We prove that (1) a branching time Computation Tree Logic CTL, (2) the propositional-Calculus of D. Kozen C , and (3) the second-order propositional program logic 2M of C. Stirling enjoy the equal model checking pow...
متن کاملذخیره در منابع من
با ذخیره ی این منبع در منابع من، دسترسی به آن را برای استفاده های بعدی آسان تر کنید
عنوان ژورنال:
دوره شماره
صفحات -
تاریخ انتشار 2006